Modified MUF and EDF Algorithms for Overloaded Soft Real Time Systems
ثبت نشده
چکیده
This paper proposes static and dynamic mechanisms by which MUF scheduling algorithm can be made more effective in overloaded soft real time systems (such as multimedia) using the concept of Random Dropping (RD) and negative laxity check. With introduction of RD, both algorithms result in higher values of DMTR as compared to without RD. Using negative laxity check and appropriate random dropping, EDF gives better results as compared to MUF across all tasks – important and less important.
منابع مشابه
Real-Time Scheduling of Sensor-Based Control Systems
Many sensor-based control systems are dynamically changing, and thus require a flexible scheduler. The rate monotonic (RM) real-time scheduling algorithm does not support such dynamic systems very well. On the other hand, with earliest-deadline-first (EDF) and minimum-laxity-first (MLF) dynamic scheduling algorithms, a transient overload in the system may cause a critical task to fail, which is...
متن کاملGenetic Algorithm Based Adaptive Scheduling Algorithm for Real Time Operating Systems
In this paper novel technique for CPU scheduling in real time operating systems by using genetic algorithm (GA) is proposed. Proposed adaptive algorithm is a combination of existing dynamic priority driven algorithm i.e. Earliest Deadline First (EDF) and new genetic algorithm (GA) based scheduling algorithm. First we have developed GA based scheduling algorithm and tested it during both under l...
متن کاملFuzzy EDF Algorithm for Soft Real Time Systems
EDF is a classic dynamic embedded realtime multi-task scheduling algorithm. In an embedded soft real-time system, the deadline missing ratio is an important metric to evaluate system performance. When an embedded soft realtime system is overloaded, EDF algorithm is not effective. Considering the unsteadiness and unpredictability of a practical task running environment due to the unsteadiness of...
متن کاملA non-preemptive scheduling algorithm for soft real-time systems
1 Please direct all correspondence to Krishna Kavi, Department of Computer Science and Engineering, The University of North Texas, P.O. Box 311366, Denton, Texas 76203, [email protected] Abstract Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring no...
متن کاملUpgraded Maximum Urgency First Algorithm For Real Time Systems
In this paper Upgraded Maximum Urgency First (UMUF) scheduling algorithm has been proposed. This algorithm is a further improvement in MMUF algorithm [1] and is a mixed priority scheduling algorithm which combines the advantages of both fixed and dynamic scheduling for better CPU utilization and throughput. The prime objective of this paper is to improve modified maximum urgency first schedulin...
متن کامل